By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 22, Issue 2, pp. 221-429

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Recursive Star-Tree Parallel Data Structure

Omer Berkman and Uzi Vishkin

pp. 221-242

Approximate Boyer–Moore String Matching

Jorma Tarhio and Esko Ukkonen

pp. 243-260

Two Probabilistic Results on Merging

Wenceslas Fernandez de la Vega, Sampath Kannan, and Miklos Santha

pp. 261-271

Optimal Randomized Algorithms for Local Sorting and Set-Maxima

Wayne Goddard, Claire Kenyon, Valerie King, and Leonard J. Schulman

pp. 272-283

A Monte-Carlo Algorithm for Estimating the Permanent

N. Karmarkar, R. Karp, R. Lipton, L. Lovász, and M. Luby

pp. 284-293

Limiting Negations in Constant Depth Circuits

Miklos Santha and Christopher Wilson

pp. 294-302

Average Time Analysis of Clause Order Backtracking

Khaled M. Bugrara and Paul Walton Purdom, Jr.

pp. 303-317

Factoring Rational Polynomials over the Complex Numbers

Chanderjit Bajaj, John Canny, Thomas Garrity, and Joe Warren

pp. 318-331

Optimal Stochastic Allocation of Machines under Waiting-Time Constraints

E. G. Coffman, Jr., Leopold Flatto, and Paul E. Wright

pp. 332-348

An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham's List Scheduling

Gábor Galambos and Gerhard J. Woeginger

pp. 349-355

Theoretical Aspects of VLSI Pin Limitations

Robert Cypher

pp. 356-378

Gap Theorems for Distributed Computation

Shlomo Moran and Manfred K. Warmuth

pp. 379-394

On Languages with Very High Space-Bounded Kolmogorov Complexity

Ronald V. Book and Jack H. Lutz

pp. 395-402

Coin-Flipping Games Immune against Linear-Sized Coalitions

Noga Alon and Moni Naor

pp. 403-417

On the Zone Theorem for Hyperplane Arrangements

Herbert Edelsbrunner, Raimund Seidel, and Micha Sharir

pp. 418-429